NORA / HAMMR : Making Deduction - Based SoftwareComponent Retrieval Practical yBernd

نویسنده

  • Bernd Fischer
چکیده

Deduction-based software component retrieval uses pre-and postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This idea is very simple but the vast number of arising proof tasks makes a practical implementation very hard. We thus pass the components through a chain of lters of increasing deductive power. In this chain, rejection lters based on signature matching and model checking techniques are used to rule out non-matches as early as possible and to prevent the subsequent ATP from \drowning." Hence, intermediate results of reasonable precision are available at (almost) any time of the retrieval process. The nal ATP step then works as a connrmation lter to lift the precision of the answer set. We implemented a chain which runs fully automatically and uses MACE for model checking and SETHEO as ATP and evaluated it over a medium-sized collection of components. The results connrm the practicality of our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical

Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This idea is very simple but the vast number of arising proof tasks makes a practical implementation very hard. We thus pass the components through a chain of filters of increasing deductive power. In this chain, rejection...

متن کامل

Deduction-based software component retrieval

Deduktionsbasiertes Softwarekomponenten-Retrieval ist eine formale, semantik-basierte Methode zur Unterstützung der Software-Wiederverwendung. Dabei werden formale Spezifikationen als Komponentendeskriptoren und als Suchanfragen verwendet und passende Komponenten mit Hilfe automatischer Theorembeweiser ermittelt. Die direkte Realisierung dieses Konzepts scheitert allerdings an der Anzahl und am...

متن کامل

SETHEO Goes Software Engineering: Application of ATP to Software Reuse

Reuse of approved software components has been identified as one of the key factors for successful software engineering projects. Although the reuse process also covers many non-technical aspects [9] we will restrict ourselves to the retrieval of software components (SCR) based on their formal specifications. Our system NORA/HAMMR 3 is based on a library of software components with associated s...

متن کامل

Deduction-based Software Component Retrieval Discussions and Joint Papers With

Identifying appropriate software components in a library—or software component retrieval—is an important task in software reuse: after all, components must be found before they can be reused. Deduction-based retrieval uses formal specifications as component descriptors and as search keys and an automated theorem prover to check whether a component matches a query. It is thus the only component ...

متن کامل

Experiments with ATP Integration in a

We describe a combination of the NORA/HAMMR software component retrieval tool and the ILF system which provides the necessary infrastructure to apply diierent rst-order theorem provers to the emerging proof problems. This framework allows the cooperation of independent deductive subsystems in two diierent modes. Our results show that both modes|competition between problem variants or provers an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008